Formally speaking

Formally Speaking About Schemata, Bases, Classes and Objects

In the early 70’s, Dana Scott and Christopher Stratchey laid the foundations for the theory of denotational semantics of traditional programming languages. The aim pursued in this paper is to show how concepts such as semantic domains, semantic interpretation functions and denotations can be used to describe facilities for handling non-conventional info that combines object-orientation and data...

Formally-Proven Kosaraju’s algorithm

This notes explains how the Kosaraju’s algorithm that computes the strong-connected components of a directed graph has been formalised in the Coq prover using the SSReflect extension.

Formally Assessing Cryptographic Entropy

Cryptography relies on the secrecy of keys. Measures of information, and thus secrecy, are called entropy. Previous work does not formally assess the cryptographically appropriate entropy of secret keys. This report defines several new forms of entropy appropriate for cryptographic situations. This report defines statistical inference methods appropriate for assessing cryptographic entropy.

Formally Secure Compilation

Severe low-level vulnerabilities abound in today’s computer systems, allowing cyber-attackers to remotely gain full control. This happens in big part because our programming languages, compilers, and architectures were designed in an era of scarce hardware resources and too often trade off security for efficiency. The semantics of mainstream low-level languages like C is inherently insecure, an...

Formally Secure Compilation